Estimating Multiclass Service Demand Distributions Using Markovian Arrival Processes

نویسندگان

چکیده

Building performance models for software services in DevOps is costly and error-prone. Accurate service demand distribution estimation critical to precisely modeling queueing behaviors prediction. However, current methods focus on capturing the mean demand, disregarding higher-order moments of that still can largely affect prediction accuracy. To address this limitation, we propose estimate higher a microservice from monitoring traces. We first generate closed model abstract use it departure process requests completed by as Markovian arrival (MAP). This allows formulating into an optimization problem, which aims find multiple maximize likelihood MAP using generated measured inter-departure times. then different classes with maximum algorithm novel heuristics mitigate computational cost scalability. apply our method real traces microservice-based application demonstrate its estimations lead greater accuracy than exponential distributions assumed traditional approaches services.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Batch Markovian Arrival Processes (BMAP)

This article describes the batch Markovian arrival process (BMAP), a point process that is characterized by Markov-modulated batch arrivals of random size. The BMAP is a generalization of many well-known processes including the Markovian arrival process (MAP), the Poisson process, and the Markov-modulated Poisson process. It provides a common framework for modeling arrival processes in a variet...

متن کامل

Approximate Model for Merging Markovian Arrival Processes

Traffic-based decomposition models encompass procedures required for modelling of the basic network operations of superposition, departure and splitting, arising due to the common sharing of the resources and routing decisions taking place in packetswitched networks. It is desirable to study such models for Markovian Arrival Processes (MAPs), as these processes are able to match correlations an...

متن کامل

Markovian Queues with Correlated Arrival Processes

In an attempt to examine the effect of dependencies in the arrival process on the steady state queue length process in single server queueing models with exponential service time distribution, four different models for the arrival process, each with marginally distributed exponential interarrivals to the queueing system, are considered. Two of these models are based upon the upper and lower bou...

متن کامل

Approximate Analysis of Queueing Networks with Markovian Arrival Processes and Phase Type Service Times

Open queueing networks with Markovian arrival processes and phase type service times are considered. A technique is proposed for the speciication of the models. Using such a speciication, a Markov chain can be generated automatically. Furthermore, this description can be used immediately for simulation. An approximate disaggregation{aggregation technique for nite state Markov chains is applied....

متن کامل

Doubly Exponential Solution for Randomized Load Balancing Models with Markovian Arrival Processes and PH Service Times

In this paper, we provide a novel matrix-analytic approach for studying doubly exponential solutions of randomized load balancing models (also known as supermarket models) with Markovian arrival processes (MAPs) and phase-type (PH) service times. We describe the supermarket model as a system of differential vector equations by means of density dependent jump Markov processes, and obtain a close...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: ACM Transactions on Modeling and Computer Simulation

سال: 2023

ISSN: ['1049-3301', '1558-1195']

DOI: https://doi.org/10.1145/3570924